Designing Minimum Cost Nonblocking Communication Networks

نویسندگان

  • J Andrew Fingerhut
  • Subhash Suri
  • Jonathan S Turner
  • Andrew Fingerhut
چکیده

This paper addresses the problem of topological design of ATM (and similar) communication networks. We formulate the problem from a worst-case point of view, seeking network desings that, subject to specified traffic constraints, are nonblocking for point-to-point and multicast virtual circuits. Within this model we give various conditions under which star networks are optimal or near-optimal. These conditions are approximately satisfied in many common situations making the results of practical significance. An important consequence of these results is that, where they apply, there is no added cost for nonblocking multicast communication, relative to networks that are nonblocking for point-to-point traffic only.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing Minimum Cost Nonblocking Communication Networks Designing Minimum Cost Nonblocking Communication Networks

This paper addresses the problem of topological design of ATM (and similar) communication networks. We formulate the problem from a worst-case point of view, seeking network designs that, subject to speciied raac constraints, are nonblocking for point-to-point and multicast virtual circuits. Within this model we give various conditions under which star networks are optimal or near-optimal. Thes...

متن کامل

Designing Least-Cost Nonblocking Broadband Networks

Integrated network technologies, such as ATM, support multimedia applications with vastly diierent bandwidth needs, connection request rates, and holding patterns. Due to their high level of exibility and communication rates approaching several gigabits per second, the classical network planning techniques, which rely heavily on statistical analysis, are less relevant to this new generation of ...

متن کامل

Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N log N) Bit-Complexity

Principles for designing practical self-routing nonblocking N × N circuit-switched connection networks with optimal q(N ◊ log N) hardware at the bit-level of complexity are described. The overall principles behind the architecture can be described as “Expand-Route-Contract.” A self-routing nonblocking network with w-bit wide datapaths can be achieved by expanding the datapaths to w + z independ...

متن کامل

Virtual Nonblocking Switching Networks

Nonblocking networks are always favored to be used as switching networks whenever possible. There are three types of nonblocking networks, namely rearrangeable nonblocking networks, wide-sense nonblocking networks, and strictly nonblocking networks. Large-scale wide-sense nonblocking networks and strictly nonblocking networks may be infeasible due to their high cost. In contrast, rearrangeable ...

متن کامل

Design of Nonblocking ATM Networks

This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to specified constraints on the traffic. In this paper, we focus on global traffic constraints that simply limit the total entering and exiting traffic at each switching system. After reviewing prior results for linear link costs, we introduce a more realistic link c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996